Queue layouts on folded hypercubes FQ n with n 6 7 Kung –
نویسندگان
چکیده
A queue layout of a graph consists of a linear order of its vertices and a partition of its edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph G, denoted by qn(G), is called the queuenumber of G. An n-dimensional folded hypercube, denoted by FQn, is an enhanced n-dimensional hypercube with one extra edge between vertices that have the furthest Hamming distance. In this paper, we deal with queue layout of folded hypercubes and contribute some results as follows: (1) qn(FQn) = 2 if n ∈ {2, 3}. (2) 2 6 qn(FQ4) 6 4. (3) 2 6 qn(FQ5) 6 6. (4) 2 6 qn(FQ6) 6 7. (5) 3 6 qn(FQ7) 6 12.
منابع مشابه
Efficient VLSI Layouts of Hypercubic Networks
In this paper, we present efficient VLSI layouts of several hypercubic networks. We show that an N-node hypercube and an N-node cube-connected cycles (CCC) graph can be laid out in 4N2=9 + o(N2) and 4N2=(9log22 N) + o(N2= log2 N) areas, respectively, both of which are optimal within a factor of 1:7̄+ o(1). We introduce the multilayer grid model, and present efficient layouts of hypercubes that u...
متن کاملMultilayer VLSI Layout for Interconnection Networks
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about L 2 2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a fac...
متن کاملQueue Layouts of Hypercubes
A queue layout of a graph consists of a linear ordering σ of its vertices, and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to σ. We show that the n-dimensional hypercube Qn has a layout into n−blog2 nc queues for all n ≥ 1. On the other hand, for every ε > 0 every queue layout of Qn has more than ( 1 2 − ε)n−O(1/ε) queues, and in...
متن کاملAn improved upper bound on the queuenumber of the hypercube
Recently, Hasunuma and Hirota [1] addressed themselves to study the queue layout problem on hypercubes. The n-dimensional hypercube Qn is a graph with 2n vertices in which each vertex corresponds to an n-tuple (b1,b2, . . . ,bn) on the set {0,1}n and two vertices are linked by an edge if and only if they differ in exactly one coordinate [3]. A k-queue layout of a graph G consists of a linear or...
متن کاملLayout Volumes of the Hypercube
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Graph Drawing 2003 [5]. For both models we prove general lower bounds which relate volumes of layouts to a graph parameter cutwidth. Then we propose tight bounds on volumes of layouts of N -vertex hypercubes. Especially,...
متن کامل